Combinatorial Problems about Free Groups and Algebras
نویسندگان
چکیده
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more generally, homomorphisms of various algebraic systems by means of their action on \very small" sets of elements, as opposed to a traditional approach of studying their action on subsystems (like subgroups, normal subgroups; subalgebras, ideals, etc.) We will show that there is a lot that can be said about a homomorphism, given its action on just a single element, if this element is \good enough". Then, we consider somewhat bigger sets of elements, like, for example, automorphic orbits, and study a variety of interesting problems arising in that framework. One more point that we make here is that one can use similar combinatorial ideas in seemingly distant areas of algebra, like, for example, group theory and commutative algebra. In particular, we use the same language of \elementary transformations" in di erent contexts and show that this approach appears to be quite fruitful for all the areas involved. Partially supported by RFBR and by INTAS. y Partially supported by RGC Fundable Grant 334/024/0002 and CRCG Grant 335/024/0008.
منابع مشابه
A primer of Hopf algebras
In this paper, we review a number of basic results about so-called Hopf algebras. We begin by giving a historical account of the results obtained in the 1930's and 1940's about the topology of Lie groups and compact symmetric spaces. The climax is provided by the structure theorems due to Hopf, Samelson, Leray and Borel. The main part of this paper is a thorough analysis of the relations betwee...
متن کاملBlowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
Let I = (x1 , . . . , xq ) be a square-free monomial ideal of a polynomial ring K[x1, . . . , xn] over an arbitrary field K and let A be the incidence matrix with column vectors v1, . . . , vq. We will establish some connections between algebraic properties of certain graded algebras associated to I and combinatorial optimization properties of certain polyhedrons and clutters associated to A an...
متن کاملOn Permutation Statistics and Hecke Algebra Characters
Irreducible characters of Hecke algebras of type A may be represented as reened counts of simple statistics on suitable subsets of permutations. Such formulas have been generalized to characters of other Coxeter groups and their Hecke algebras and to coinvariant algebras. In this paper we present several formulas, applications to combinatorial identities, and related problems. New results are g...
متن کاملCombinatorial Hopf Algebras of Simplicial Complexes
We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their f -vectors. We al...
متن کاملProfinite semigroups and applications∗
Profinite semigroups may be described shortly as projective limits of finite semigroups. They come about naturally by studying pseudovarieties of finite semigroups which in turn serve as a classifying tool for rational languages. Of particular relevance are relatively free profinite semigroups which for pseudovarieties play the role of free algebras in the theory of varieties. Combinatorial pro...
متن کامل